Quadratically Tight Relations for Randomized Query Complexity
نویسندگان
چکیده
منابع مشابه
Quadratically Tight Relations for Randomized Query Complexity
Let f : {0, 1} → {0, 1} be a Boolean function. The certificate complexity C(f) is a complexity measure that is quadratically tight for the zero-error randomized query complexity R0(f): C(f) ≤ R0(f) ≤ C(f) . In this paper we study a new complexity measure that we call expectational certificate complexity EC(f), which is also a quadratically tight bound on R0(f): EC(f) ≤ R0(f) = O(EC(f) ). We pro...
متن کاملA quadratically tight partition bound for classical communication complexity and query complexity
In this work we introduce, both for classical communication complexity and query complexity, a modification of the partition bound introduced by Jain and Klauck [JK10]. We call it the public-coin partition bound. We show that (the logarithm to the base two of) its communication complexity and query complexity versions form, for all relations, a quadratically tight lower bound on the public-coin...
متن کاملA Quadratically Tight Partition Bound for Classical Communication and Query Complexity
The partition bound introduced in [4] is a way to prove lower bounds in classical communication and query complexity. While the partition bound provides a strong and general way to prove lower bounds, it remains open how tight the bounds obtained from this method are. In this work we give quadratically tight lower bounds via a strengthened version of the partition bound, which we call the publi...
متن کاملA Composition Theorem for Randomized Query Complexity
Let the randomized query complexity of a relation for error probability ǫ be denoted by Rǫ(·). We prove that for any relation f ⊆ {0, 1} × R and Boolean function g : {0, 1} → {0, 1}, R1/3(f ◦g ) = Ω(R4/9(f) ·R1/2−1/n4(g)), where f ◦g n is the relation obtained by composing f and g. We also show that R1/3 (
متن کاملLifting randomized query complexity to randomized communication complexity
We show that for any (partial) query function f : {0, 1} → {0, 1}, the randomized communication complexity of f composed with Indexm (with m = poly(n)) is at least the randomized query complexity of f times log n. Here Indexm : [m] × {0, 1} → {0, 1} is defined as Indexm(x, y) = yx (the xth bit of y). Our proof follows on the lines of Raz and Mckenzie [RM99] (and its generalization due to [GPW15...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2019
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-019-09935-x